Probabilistic integer sorting

Programming Research Group A NOTE ON PROBABILISTIC INTEGER SORTING

We present a new probabilistic sequential algorithm for stable sorting n uniformly distributed keys in an arbitrary range. The algorithm runs in linear time with very-high probability 1 ? 2 ?(n) (the best previously known probability bound has been 1 ? 2 ?(n=(lg n lg lg n))). We also describe an EREW PRAM version of the algorithm that sorts in O((n=p + lg p) lg n= lg (n=p + lg n)) time using p ...

An improved reliability bound of a probabilistic parallel integer sorting algorithm

It is shown how one can improve the reliability bound of the parallel sorting algorithm of Rajasekaran and Sen [7] that sorts uniformly distributed integer keys on a CRCW Parallel Random Access Machine (PRAM). The probability of success improves to 1 − 2−Ω(n log logn/ logn) from the previous bound of 1 − 2−Ω(n/(logn log logn)) while retaining the Õ(log n) time bound for sorting n uniformly dist...

Probabilistic Power Distribution Planning Using Multi-Objective Harmony Search Algorithm

In this paper, power distribution planning (PDP) considering distributed generators (DGs) is investigated as a dynamic multi-objective optimization problem. Moreover, Monte Carlo simulation (MCS) is applied to handle the uncertainty in electricity price and load demand. In the proposed model, investment and operation costs, losses and purchased power from the main grid are incorporated in the f...

Fast Parallel Space Allocation, Estimation and Integer Sorting

Fast Parallel Space Allocation, Estimation and Integer Sorting (revised) •

On Parallel Hashing and Integer Sorting